منابع مشابه
Optimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs
In the random k-uniform hypergraph H (k) n,p of order n, each possible k-tuple appears independently with probability p. A loose Hamilton cycle is a cycle of order n in which every pair of consecutive edges intersects in a single vertex. It was shown by Frieze that if p ≥ c(log n)/n2 for some absolute constant c > 0, then a.a.s. H (3) n,p contains a loose Hamilton cycle, provided that n is divi...
متن کاملSpecialization of Zero Cycles
Let X be a proper scheme over a field K. There are two ways of organizing the points of X into equivalence classes using rational curves. One is the notion of R-equivalence introduced by [Manin72]. Two points x1, x2 ∈ X(K) are called directly R-equivalent if there is a morphism p : P → X with p(0:1) = x1 and p(1:0) = x2. This generates an equivalence relation called R-equivalence. The set of R-...
متن کاملnon-divisibility for abelian groups
Throughout all groups are abelian. We say a group G is n-divisible if nG = G. If G has no non-zero n-divisible subgroups for all n>1 then we say that G is absolutely non-divisible. In the study of class C consisting all absolutely non-divisible groups such as G, we come across the sub groups T_p(G) = the sum of all p-divisible subgroups and rad_p(G) = the intersection of all p^nG. The proper...
متن کاملInfinite Divisibility of Gaussian Squares with Non–zero Means
Let η = (η1, . . . , ηn) be an R n valued Gaussian random variable and c = (c1, . . . , cn) a vector in R. We give necessary and sufficient conditions for ((η1 + c1α) , . . . , (ηn + cnα) ) to be infinitely divisible for all α ∈ R, and point out how this result is related to local times of Markov chains determined by the covariance matrix of η.
متن کاملZPC Matrices and Zero Cycles
Let H be an m × n real matrix and let Zi be the set of column indices of the zero entries of row i of H. Then the conditions |Zk ∩ ∪k−1 i 1 Zi | ≤ 1 for all k 2 ≤ k ≤ m are called the row Zero Position Conditions ZPCs . If H satisfies the ZPC, then H is said to be a row ZPC matrix. If H satisfies the ZPC, thenH is said to be a column ZPCmatrix. The real matrixH is said to have a zero cycle if H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Mathematics
سال: 2021
ISSN: 2199-675X,2199-6768
DOI: 10.1007/s40879-021-00471-y